David E. Joyce has made an impressive Mandelbrot-Julia-Set-Explorer
at http://aleph0.clarku.edu/~djoyce/julia/explorer.html
We
strongly recommend, that you try this site.
What are
complex numbers?
The Mandelbrot set is the domain of convergence of the series built up by the
complex sequence defined by the recursion law: If you are familiar with complex numbers, you can skip this section. If you
haven't encountered complex numbers during your studies, don't worry! In order
to learn what they are and how to use them to build fractals you only need some
simple concepts. Example: Now imagine a plane with two coordinate axis on it. We can associate each
point of the plane with a complex number of the form:
A complex number is made by two parts: the real part and the
imaginary part. The real part is a real number (i.e. an ordinary number), the
imaginary part is another real number multiplied by i, which is called
the imaginary unit and is defined as the square root of -1, so that
We need to define some operations to deal with complex numbers:
Adding two complex numbers is very simple. Let's take two complex numbers:
Example:
In order to multiply Z1 by Z2 we only need to remember
the distributive law and the equation
Example (with the values above):
In particular, the square of a complex number (i.e. the complex number
multiplied by itself) is defined as:
Don't forget the above formula,
because we'll use it to build Mandelbrot and Julia sets.
What is the Mandelbrot set?
The Mandelbrot set is the domain of convergence of the series built up by the
complex sequence defined by the recursion law:
It is also possible to assign a colour to the points outside the Mandelbrot set. Their colour depends on how many iterations have been required to determine that they are outside the Mandelbrot set, and it can be interpreted as their "distance" from the Mandelbrot set.
How can I build the Mandelbrot
set?
Pick a point on the complex plane (let's call it C). The
corresponding complex number has the form:
Let's take a look to the algorithm from a different point of view. Let's imagine that all the points on the plane are "attracted" either by infinity or by the Mandelbrot set. This makes easy to understand why
What is the trick?
As you can
see, it is impossible to apply the process described above, because we can't
iterate the function an infinite number of times to see whether or not
the point goes to infinity, but it's easy to prove that if the distance of the
point from the origin becomes greater than two, it will grow without limit.
Therefore, if the distance of the point from the origin reaches the value of two
we can stop the iteration process because we know that the point will go to
infinity, and we can assign a colour to it according to the number of iterations
already done (a small number of iterations means that the point is rapidly going
to infinity).
On the other hand, if the point belongs to the Mandelbrot set
its distance from the origin will never become greater than two, no matter how
many iterations we do. Even if the point does not belong to the Mandelbrot set,
it could take a really huge number of iterations to reveal that it will escape
to infinity. In either case, we set a maximum number of iterations, after which
we assume it is part of the set (and we paint it black).
The more iterations
we use, the more detailed our image will be, but the longer it will take to
generate.
Examples:
To produce an image
of the whole Mandelbrot set, we need to repeat the process described above for
all the points of the complex plane whose coordinates are included in this
range:
Let's see how to assign a colour to a particular
point of the plane. Let's start with a point outside the Mandelbrot set:
Iterating the function
|
|
At the third iteration, the distance of the point from the origin becomes greater than two. This means that the initial point C does not belong to the Mandelbrot set. Since the number of iterations required to determine this is 3, we assign to C the colour labelled #3. All the points with the same colour require the same number of iterations to reveal that they are attracted by infinity.
Let's repeat the same process with a point inside the Mandelbrot set:
|
|
What is the difference between Julia sets and the Mandelbrot set?
Julia sets are strictly connected with the Mandelbrot set. The iterative
function used to produce both Mandelbrot and Julia sets is:
What is different is the way this formula is used.
Each point of the complex plane is associated with a Julia set, so you can think
to the Mandelbrot set as an "index" of all the Julia sets: each point of the
Mandelbrot set is associated with a particular Julia set.
The process of building a Julia set is the same used for the Mandelbrot set. The only difference is that for the Julia set C is fixed, while Z varies.
Pick a point on the complex plane (let's call it C). The corresponding complex number has the form:Note that whilst the Mandelbrot set is connected (i.e. it is a single piece),
a Julia set is connected only if it is associated with a point inside the
Mandelbrot set.
Example: the Julia set associated with C1 is connected; the
Julia set associated with C2 is not connected (see image below).
The method used to produce images representing the Julia sets is the same
used for the Mandelbrot set. If the distance of the point from the origin
becomes bigger than two, we are sure that it will grow without limit. Therefore,
if this distance reaches the value of two, we can stop the iteration process
because we know that the point will go to infinity, and we can colour the point
according to the number of iterations already done (a great number of iterations
means that the point is going to infinity slowly). If the point belongs to the
Julia set, its distance from the origin will never become greater than two, no
matter how many iterations we do.
Even if the point does not belong to the
Julia set, it could take a really huge number of iterations to reveal that it is
attracted by infinity. In either case, we set a maximum number of iterations,
after which we assume it is part of the Julia set (colouring it black).
The
more iterations we use, the more detailed our image will be, but the longer it
will take to generate.
En kurve kan udfylde et areal
se kurven på http://www.cut-the-knot.com/do_you_know/hilbert.html,
hvor en Java-Applet danner kurven
En forkortet version er lagt her
Disse kurver kaldes Peano-kurver. (G. Peano, matematiker, 1858-1932) Peano's eksempel er her (gif-billede)
En definition på "fractal"
tekst hentet på http://fractal.mta.ca/sci.fractals-faq/whatis.html
Subject: What is a fractal?
Question: What is a fractal? What are some examples of fractals?
Answer: A fractal is a rough or fragmented geometric shape that can be subdivided in parts, each of which is (at least approximately) a reduced-size copy of the whole. Fractals are generally self-similar and independent of scale.
There are many mathematical structures that are fractals; e.g. Sierpinski triangle, Koch snowflake, Peano curve, Mandelbrot set, and Lorenz attractor. Fractals also describe many real-world objects, such as clouds, mountains, turbulence, coastlines, roots, branches of trees, blood vesels, and lungs of animals, that do not correspond to simple geometric shapes.
Benoit B. Mandelbrot gives a mathematical definition of a fractal as a set of which the Hausdorff Besicovich dimension strictly exceeds the topological dimension. However, he is not satisfied with this definition as it excludes sets one would consider fractals.
According to Mandelbrot, who invented the word: "I coined fractal from the Latin adjective fractus. The corresponding Latin verb frangere means "to break:" to create irregular fragments. It is therefore sensible - and how appropriate for our needs! - that, in addition to "fragmented" (as in fraction or refraction), fractus should also mean "irregular," both meanings being preserved in fragment." (The Fractal Geometry of Nature, page 4.)
Due thanks are given to http://www.geocities.com/CapeCanaveral/2854/
Fabio
Cesari, fabioc@geocities.com
Siden opdateret 11.8.98. N.B.Olsen, DTV